Maximal independent families and a topological consequence

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal independent families and a topological consequence

For κ ω and X a set, a familyA⊆P(X) is said to be κ-independent on X if |⋂A∈F Af (A)| κ for each F ∈ [A]<ω and f ∈ {−1,+1}F ; here A+1 =A and A−1 =X\A. Theorem 3.6. For κ ω, some A ⊆ P(κ) with |A| = 2κ is simultaneously maximal κindependent and maximal ω-independent on κ . The family A may be chosen so that every two elements of κ are separated by 2κ -many elements of A. Corollary 5.4. For κ ω ...

متن کامل

Degrees of M-fuzzy families of independent L-fuzzy sets

The present paper studies fuzzy matroids in view of degree. First wegeneralize the notion of $(L,M)$-fuzzy independent structure byintroducing the degree of $M$-fuzzy family of independent $L$-fuzzysets with respect to a mapping from $L^X$ to $M$. Such kind ofdegrees is proved to satisfy some axioms similar to those satisfiedby $(L,M)$-fuzzy independent structure. ...

متن کامل

Martin’s Axiom and Maximal Orthogonal Families

It is shown that Martin’s Axiom for σ-centred partial orders implies that every maximal orthogonal family in R is of size 20 . For x, y ∈ R define the inner product

متن کامل

Parallel Algorithms for Maximal Independent Set and Maximal Matching

We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].

متن کامل

Computing a Maximal Independent Set Using Beeps

We consider the problem of finding a maximal independent set (MIS) in the discrete beeping model introduced in DISC 2010. At each time, a node in the network can either beep (i.e., emit a signal) or be silent. Silent nodes can only differentiate between no neighbor beeping, or at least one neighbor beeping. This basic communication model relies only on carrier-sensing. Furthermore, we assume no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2003

ISSN: 0166-8641

DOI: 10.1016/s0166-8641(02)00098-6